-
1 метод ортогональных проекций
Русско-английский научно-технический словарь Масловского > метод ортогональных проекций
-
2 метод ортогональных проекций
Mathematics: method of orthogonal projectionsУниверсальный русско-английский словарь > метод ортогональных проекций
См. также в других словарях:
Biconjugate gradient method — In mathematics, more specifically in numerical analysis, the biconjugate gradient method is an algorithm to solve systems of linear equations :A x= b.,Unlike the conjugate gradient method, this algorithm does not require the matrix A to be self… … Wikipedia
Mark Vishik (mathematician) — Mark Vishik (also Marko Vishik, Russian: Марк(o) Иосифович Вишик, * October 19, 1921 in Lviv) is a mathematician from Lwów / Lemberg / Lvov / Lviv, who works in the field of Partial Differential Equations. Contents 1 Life and work 1.1 Lwów 1.2… … Wikipedia
Mark Vishik — (auch Marko Vishik; * 19. Oktober 1921 in Lwów) ist ein Mathematiker aus Lwów/Lemberg, der seit 1945 in Moskau auf dem Gebiet der Partiellen Differentialgleichungen arbeitet.[1] Inhaltsverzeichnis 1 Leben und Werk 1.1 Lwów … Deutsch Wikipedia
Hilbert space — For the Hilbert space filling curve, see Hilbert curve. Hilbert spaces can be used to study the harmonics of vibrating strings. The mathematical concept of a Hilbert space, named after David Hilbert, generalizes the notion of Euclidean space. It… … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
Linear least squares (mathematics) — This article is about the mathematics that underlie curve fitting using linear least squares. For statistical regression analysis using least squares, see linear regression. For linear regression on a single variable, see simple linear regression … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Simplex — For other uses, see Simplex (disambiguation). A regular 3 simplex or tetrahedron In geometry, a simplex (plural simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension. Specifically, an n… … Wikipedia
Mathematical formulation of quantum mechanics — Quantum mechanics Uncertainty principle … Wikipedia
Nonogram — Not to be confused with Nonagram or Nomogram. Example of a nonogram puzzle being solved. The steps of the process are grouped together a bit. Nonograms, also known as Hanjie, Paint by Numbers, or Griddlers, are picture logic puzzles in which … Wikipedia
Decagon — Regular decagon Edges and vertices 10 Schläfli symbol {10} Coxeter–Dynkin diag … Wikipedia